0.12/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.14 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.35 % Computer : n004.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 1200 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Tue Jul 13 10:11:39 EDT 2021 0.13/0.35 % CPUTime : 0.13/0.36 % Number of cores: 8 0.13/0.36 % Python version: Python 3.6.8 0.13/0.36 # Version: 2.6rc1-ho 0.13/0.36 # No SInE strategy applied 0.13/0.36 # Trying AutoSched0 for 59 seconds 0.21/0.39 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0U 0.21/0.39 # and selection function SelectComplexExceptRRHorn. 0.21/0.39 # 0.21/0.39 # Preprocessing time : 0.028 s 0.21/0.39 # Presaturation interreduction done 0.21/0.39 0.21/0.39 # Proof found! 0.21/0.39 # SZS status Theorem 0.21/0.39 # SZS output start CNFRefutation 0.21/0.39 thf(satz16b, axiom, ![X1:nat, X2:nat, X3:nat]:((some @ (^[X4:nat]:diffprop @ X3 @ X1 @ X4)<=lessis @ X2 @ X3)<=some @ (^[X4:nat]:diffprop @ X2 @ X1 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz16b)). 0.21/0.39 thf(n, axiom, some @ (^[X5:nat]:diffprop @ y @ z @ X5), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', n)). 0.21/0.39 thf(satz13, axiom, ![X1:nat, X2:nat]:(lessis @ X2 @ X1<=moreis @ X1 @ X2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz13)). 0.21/0.39 thf(satz16c, conjecture, some @ (^[X5:nat]:diffprop @ x @ z @ X5), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz16c)). 0.21/0.39 thf(m, axiom, moreis @ x @ y, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', m)). 0.21/0.39 thf(c_0_5, plain, ![X4:nat, X1:nat, X3:nat]:(epred1_3 @ X3 @ X1 @ X4<=>diffprop @ X3 @ X1 @ X4), introduced(definition)). 0.21/0.39 thf(c_0_6, plain, ![X1:nat, X2:nat, X3:nat]:(some @ (epred1_3 @ X2 @ X1)=>(lessis @ X2 @ X3=>some @ (epred1_3 @ X3 @ X1))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz16b, c_0_5]), c_0_5])])). 0.21/0.39 thf(c_0_7, plain, ![X11:nat, X12:nat, X13:nat]:(~some @ (epred1_3 @ X12 @ X11)|(~lessis @ X12 @ X13|some @ (epred1_3 @ X13 @ X11))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])). 0.21/0.39 thf(c_0_8, axiom, some @ (epred1_3 @ y @ z), inference(apply_def,[status(thm)],[n, c_0_5])). 0.21/0.39 thf(c_0_9, plain, ![X1:nat, X2:nat]:(moreis @ X1 @ X2=>lessis @ X2 @ X1), inference(fof_simplification,[status(thm)],[satz13])). 0.21/0.39 thf(c_0_10, plain, ![X1:nat, X2:nat, X3:nat]:(some @ (epred1_3 @ X3 @ X2)|~some @ (epred1_3 @ X1 @ X2)|~lessis @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_7])). 0.21/0.39 thf(c_0_11, plain, some @ (epred1_3 @ y @ z), inference(split_conjunct,[status(thm)],[c_0_8])). 0.21/0.39 thf(c_0_12, plain, ![X14:nat, X15:nat]:(~moreis @ X14 @ X15|lessis @ X15 @ X14), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])). 0.21/0.39 thf(c_0_13, plain, ![X1:nat]:(some @ (epred1_3 @ X1 @ z)|~lessis @ y @ X1), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.21/0.39 thf(c_0_14, plain, ![X1:nat, X2:nat]:(lessis @ X2 @ X1|~moreis @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_12])). 0.21/0.39 thf(c_0_15, negated_conjecture, ~some @ (epred1_3 @ x @ z), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz16c]), c_0_5])])). 0.21/0.39 thf(c_0_16, plain, ![X1:nat]:(some @ (epred1_3 @ X1 @ z)|~moreis @ X1 @ y), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.21/0.39 thf(c_0_17, plain, moreis @ x @ y, inference(split_conjunct,[status(thm)],[m])). 0.21/0.39 thf(c_0_18, negated_conjecture, ~some @ (epred1_3 @ x @ z), inference(split_conjunct,[status(thm)],[c_0_15])). 0.21/0.39 thf(c_0_19, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), ['proof']). 0.21/0.39 # SZS output end CNFRefutation 0.21/0.39 # Proof object total steps : 20 0.21/0.39 # Proof object clause steps : 8 0.21/0.39 # Proof object formula steps : 12 0.21/0.39 # Proof object conjectures : 3 0.21/0.39 # Proof object clause conjectures : 1 0.21/0.39 # Proof object formula conjectures : 2 0.21/0.39 # Proof object initial clauses used : 5 0.21/0.39 # Proof object initial formulas used : 5 0.21/0.39 # Proof object generating inferences : 3 0.21/0.39 # Proof object simplifying inferences : 1 0.21/0.39 # Training examples: 0 positive, 0 negative 0.21/0.39 # Parsed axioms : 13 0.21/0.39 # Removed by relevancy pruning/SinE : 0 0.21/0.39 # Initial clauses : 15 0.21/0.39 # Removed in clause preprocessing : 8 0.21/0.39 # Initial clauses in saturation : 7 0.21/0.39 # Processed clauses : 16 0.21/0.39 # ...of these trivial : 0 0.21/0.39 # ...subsumed : 0 0.21/0.39 # ...remaining for further processing : 16 0.21/0.39 # Other redundant clauses eliminated : 0 0.21/0.39 # Clauses deleted for lack of memory : 0 0.21/0.39 # Backward-subsumed : 0 0.21/0.39 # Backward-rewritten : 0 0.21/0.39 # Generated clauses : 4 0.21/0.39 # ...of the previous two non-trivial : 2 0.21/0.39 # Contextual simplify-reflections : 0 0.21/0.39 # Paramodulations : 4 0.21/0.39 # Factorizations : 0 0.21/0.39 # NegExts : 0 0.21/0.39 # Equation resolutions : 0 0.21/0.39 # Propositional unsat checks : 0 0.21/0.39 # Propositional check models : 0 0.21/0.39 # Propositional check unsatisfiable : 0 0.21/0.39 # Propositional clauses : 0 0.21/0.39 # Propositional clauses after purity: 0 0.21/0.39 # Propositional unsat core size : 0 0.21/0.39 # Propositional preprocessing time : 0.000 0.21/0.39 # Propositional encoding time : 0.000 0.21/0.39 # Propositional solver time : 0.000 0.21/0.39 # Success case prop preproc time : 0.000 0.21/0.39 # Success case prop encoding time : 0.000 0.21/0.39 # Success case prop solver time : 0.000 0.21/0.39 # Current number of processed clauses : 9 0.21/0.39 # Positive orientable unit clauses : 2 0.21/0.39 # Positive unorientable unit clauses: 0 0.21/0.39 # Negative unit clauses : 1 0.21/0.39 # Non-unit-clauses : 6 0.21/0.39 # Current number of unprocessed clauses: 0 0.21/0.39 # ...number of literals in the above : 0 0.21/0.39 # Current number of archived formulas : 0 0.21/0.39 # Current number of archived clauses : 7 0.21/0.39 # Clause-clause subsumption calls (NU) : 9 0.21/0.39 # Rec. Clause-clause subsumption calls : 9 0.21/0.39 # Non-unit clause-clause subsumptions : 0 0.21/0.39 # Unit Clause-clause subsumption calls : 0 0.21/0.39 # Rewrite failures with RHS unbound : 0 0.21/0.39 # BW rewrite match attempts : 0 0.21/0.39 # BW rewrite match successes : 0 0.21/0.39 # Condensation attempts : 0 0.21/0.39 # Condensation successes : 0 0.21/0.39 # Termbank termtop insertions : 655 0.21/0.39 0.21/0.39 # ------------------------------------------------- 0.21/0.39 # User time : 0.025 s 0.21/0.39 # System time : 0.006 s 0.21/0.39 # Total time : 0.032 s 0.21/0.39 # Maximum resident set size: 1648 pages 0.21/0.39 EOF